Computing Direct Shadows Cast by Convex Polyhedra
نویسندگان
چکیده
We present an exact method to compute the boundaries between umbra, penumbra and full-light regions cast on a plane by a set of disjoint convex polyhedra, some of which are light sources. This method builds on a recent characterization of topological visual event surfaces presented in a companion paper.
منابع مشابه
Some New Equiprojective Polyhedra
A convex polyhedron P is k-equiprojective if all of its orthogonal projections, i.e., shadows, except those parallel to the faces of P are k-gon for some fixed value of k. Since 1968 it is an open problem to construct all equiprojective polyhedra. Recently, Hasan and Lubiw [8] have given a characterization of equiprojective polyhedra. Based on their characterization, in this paper we discover s...
متن کاملSufficiently Fat Polyhedra are Not 2-Castable
In this note we consider the problem of manufacturing a convex polyhedral object via casting. We consider a generalization of the sand casting process where the object is manufactured by gluing together two identical faces of parts cast with a single piece mold. In this model we show that the class of convex polyhedra which can be enclosed between two concentric spheres with the ratio of their ...
متن کاملMy shadow, myself: cast-body shadows are embodied.
Objects that serve as extensions of the body can produce a sensation of embodiment, feeling as if they are a part of us. We investigated the characteristics that drive an object's embodiment, examining whether cast-body shadows, a purely visual stimulus, are embodied. Tools are represented as an extension of the body when they enable observers to interact with distant targets, perceptually dist...
متن کاملAn Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given.
متن کاملPossibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
The domain of convex polyhedra is employed in several systems for the analysis and verification of hardware and software components. Current applications span imperative, functional and logic languages, synchronous languages and synchronization protocols, real-time and hybrid systems. Since the seminal work of P. Cousot and N. Halbwachs, convex polyhedra have thus played an important role in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009